Access Support Tree & TextArray: A Data Structure for XML Document Storage & Retrieval

The characteristics of XML documents require new ways of storing and querying such documents. Queries on both textual content and structural aspects must be supported efficiently. For this reason, we examined existing work on both document storage approaches and models for querying documents deriving requirements that are essential for the storage of XML documents. As a result of our study, we designed the Access Support Tree and TextArray (AST/TA) data structure. The important idea of the AST/TA data structure is the separation of the (logical) structure of a document from its ”visible” text content, which is represented as a single contiguous string, at the same time providing a tight integration to guarantee consistent changes. We introduce the AST/TA data structure formally by its abstraction, namely the AST/TA model and compare requirements of our AST/TA approach with those found in current work. Finally, we demonstrate the superiority of the AST/TA model by describing those operations that take advantage of the design principles of the AST/TA data structure.